A tree distinguishing polynomial
نویسندگان
چکیده
We define a bivariate polynomial for unlabeled rooted trees and show that the of an tree T is generating function class subtrees . prove complete isomorphism invariant trees. Then, we generalize to unrooted generalized
منابع مشابه
Bounds for Tree Automata with Polynomial Costs1
We consider tree automata with costs over semirings in the sense of (Seidl, 1994). We define the concept of a finitely factorizing semiring and of a monotonic semiring, both as the generalization of well-known particular semirings, and show that the costfiniteness of tree automata with costs over finitely factorizing and monotonic semirings is decidable. We show that, for tree automata with cos...
متن کاملDuality and Polynomial Testing of Tree Homomorphisms
Let H be a fixed digraph. We consider the H-colouring problem, i.e., the problem of deciding which digraphs G admit a homomorphism to H. We are interested in a characterization in terms of the absence in G of certain tree-like obstructions. Specifically, we say that H has tree duality if, for all digraphs G, G is not homomorphic to H if and only if there is an oriented tree which is homomorphic...
متن کاملBounds for Tree Automata with Polynomial Costs
We consider tree automata with costs over semirings in the sense of (Seidl, 1994). We de ne the concept of a nitely factorizing semiring and of a monotonic semiring, both as the generalization of well-known particular semirings, and show that the costniteness of tree automata with costs over nitely factorizing and monotonic semirings is decidable. We show that, for tree automata with costs over...
متن کاملFaster Steiner Tree Computation in Polynomial-Space
Given an n-node graph and a subset of k terminal nodes, the NP -hard Steiner tree problem is to compute a minimum-size tree which spans the terminals. All the known algorithms for this problem which improve on trivial O(1.62)-time enumeration are based on dynamic programming, and require exponential space. Motivated by the fact that exponential-space algorithms are typically impractical, in thi...
متن کاملThe adjacent vertex-distinguishing total chromatic number of 1-tree
Let G = (V (G), E(G)) be a simple graph and T (G) be the set of vertices and edges of G. Let C be a k−color set. A (proper) total k−coloring f of G is a function f : T (G) −→ C such that no adjacent or incident elements of T (G) receive the same color. For any u ∈ V (G), denote C(u) = {f(u)} ∪ {f(uv)|uv ∈ E(G)}. The total k−coloring f of G is called the adjacent vertex-distinguishing if C(u) 6=...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2021
ISSN: ['1872-6771', '0166-218X']
DOI: https://doi.org/10.1016/j.dam.2020.08.019